Directed Random Walks on Polytopes with Few Facets
نویسنده
چکیده
Our research is motivated by the simplex algorithm for linear programming. We consider the variation where the algorithm chooses at each step the next position uniformly at random from all improving neighbouring positions; this rule is commonly called Random-Edge. Its expected runtime on general linear programs can be mildly exponential; cf. Friedmann et al. [2011]. Better bounds can be hoped for if one imposes restrictions on the input. It is intuitively plausible that Random-Edge should run very fast if the number of constraints (or facets) is very small in relation to the dimension.
منابع مشابه
Random Walks on Polytopes of Constant Corank
We show that the pivoting process associated with one line and n points in r-dimensional space may need Ω(log n) steps in expectation as n → ∞. The only cases for which the bound was known previously were for r ≤ 3. Our lower bound is also valid for the expected number of pivoting steps in the following applications: (1) The Random-Edge simplex algorithm on linear programs with n constraints in...
متن کاملRandom Walks in a Convex Body and an Improved Volume Algorithm
We give a randomized algorithm using O(n7 log’ n ) separation calls to approximate the volume of a convex body with a fixed relative error. The bound is O(n6 log4 n ) for centrally symmetric bodies and for polytopes with a polynomial number of facets, and O(n5 log4 n ) for centrally symmetric polytopes with a polynomial number of facets. We also give an O(n6 log n ) algorithm to sample a point ...
متن کاملExtension complexity of polytopes with few vertices or facets
We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of d-polytopes with at most d + 4 vertices according to their extension complexity: Out of the super-exponentially many d-polytopes with d+4 vertices, all have extension complexity d+ 4 except for some families of size θ(d). On the other hand, we show that generic re...
متن کاملThe Random Edge Simplex Algorithm on Dual Cyclic 4-polytopes
The simplex algorithm using the random edge pivot-rule on any realization of a dual cyclic 4-polytope with n facets does not take more than O(n) pivot-steps. This even holds for general abstract objective functions (AOF) / acyclic unique sink orientations (AUSO). The methods can be used to show analogous results for products of two polygons. In contrast, we show that the random facet pivot-rule...
متن کاملSimple Extensions of Polytopes
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P . We devise a combinatorial method to establish lower bounds on the simple extension complexity and show for several polytopes that they have large simple extension complexities. These example...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 61 شماره
صفحات -
تاریخ انتشار 2017